Linear Temporal Logic - ορισμός. Τι είναι το Linear Temporal Logic
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

Τι (ποιος) είναι Linear Temporal Logic - ορισμός


Linear temporal logic         
  • LTL always operator
  • LTL eventually operator
  • LTL next operator
  • LTL release operator (which does not stop)
  • LTL release operator (which stops)
  • LTL until operator
  • LTL weak until operator (which does not stop)
FIELD OF MATHEMATICAL LOGIC
Linear Temporal Logic; LTL formula; LTL logic; Linear-time temporal logic; Linear time temporal logic; Propositional temporal logic; LTL (logic)
In logic, linear temporal logic or linear-time temporal logicLogic in Computer Science: Modelling and Reasoning about Systems: page 175 (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths, e.
temporal logic         
SYSTEM FOR REPRESENTING AND REASONING ABOUT TIME
Tense logic; Temporal Logic
<logic> An extension of predicate calculus which includes notation for arguing about *when* statements are true. Time is discrete and extends indefinitely into the future. Three prefix operators, represented by a circle, square and diamond mean "is true at the next time instant", "is true from now on" and "is eventually true". x U y means x is true until y is true. x P y means x precedes y. There are two types of formula: "state formulae" about things true at one point in time, and "path formulae" about things true for a sequence of steps. An example of a path formula is "x U y", and example of a state formula is "next x" or a simple atomic formula such at "waiting". "true until" in this context means that a state formula holds at every point in time up to a point when another formula holds. "x U y" is the "strong until" and implies that there is a time when y is true. "x W y" is the "weak until" in which it is not necessary that y holds eventually. There are two types of temporal logic used: branching time and linear time. The basic propositional temporal logic cannot differentiate between the two, though. Linear time considers only one possible future, in branching time you have several alternative futures. In branching temporal logic you have the extra operators "A" (for "all futures") and "E" (for "some future"). For example, "A(work U go_home)" means "I will work until I go home" and "E(work U go_home)" means "I may work until I go home". (1997-01-21)
Temporal logic         
SYSTEM FOR REPRESENTING AND REASONING ABOUT TIME
Tense logic; Temporal Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am always hungry", "I will eventually be hungry", or "I will be hungry until I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp.